Hierarchies consistency analysis for nontransitive problems
نویسندگان
چکیده
منابع مشابه
Hierarchies for solving Non-linear SMT problems
The desire to make an industrial process cheaper often assumes a high level of automatization of production facilities. Software, although being a set of instructions executed on a machine, is purely created by the human labour. This brings up a natural question. Why would not machines be able to synthesize software and to verify its correctness? Alan Turing proved in 1936 that checking whether...
متن کاملNontransitive Dice With Equal Means∗
We analyze a game in which two players choose in turn and roll an n-sided die, each player having his choice of numbering of the faces, subject to certain constraints. The player who rolls the larger number wins. We say die B “dominates” die A if P [B > A] > P [A > B]. The nontransitivity of this dominance relation for dice has been studied by several authors. We analyze the case of n-sided dic...
متن کاملThe Concave Nontransitive Consumer
The preference of a concave nontransitive consumer is represented by a skew-symmetric and concave-convex bifunction on the set of all commodity bundles. This paper characterizes finite sets of demand observations that are consistent with the demand behavior of such kind of consumer by a generalized monotonicity property.
متن کاملPosterior Consistency for some Semi-parametric Problems
The Bayesian approach to analyzing semi-parametric models are gaining popularity in practice. For the Cox proportional hazard model, it has been shown recently that the posterior is consistent and leads to asymptotically accurate confidence intervals under a Lévy process prior on the cumulative hazard rate. The explicit expression of the posterior distribution together with independent incremen...
متن کاملDynamic consistency for stochastic optimal control problems
For a sequence of dynamic optimization problems, we aim at discussing a notion of consistency over time. This notion can be informally introduced as follows. At the very first time step t0, the decision maker formulates an optimization problem that yields optimal decision rules for all the forthcoming time step t0, t1, . . . , T ; at the next time step t1, he is able to formulate a new optimiza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1996
ISSN: 0898-1221
DOI: 10.1016/0898-1221(96)00178-2